Перевод: с английского на все языки

со всех языков на английский

graph grammar

См. также в других словарях:

  • Graph rewriting — In graph theory, graph rewriting is a system of rewriting for graphs, i.e. a set of graph rewrite rules of the form p: L ightarrow R, with L being called pattern graph (or left hand side) and R being called replacement graph (or right hand side… …   Wikipedia

  • Tripel-Graph-Grammatik — Als Tripel Graph Grammatik (engl. triple graph grammar, kurz: TGG) bezeichnet man eine spezielle Art von Graphgrammatik, die vor allem für bidirektionale Modell zu Modell Transformationen verwendet wird. Besonderheit von Tripel Graph Grammatiken… …   Deutsch Wikipedia

  • Operator-precedence grammar — An operator precedence grammar is a kind of grammar for formal languages. Technically, an operator precedence grammar is a context free grammar that has the property (among others[1]) that no production has either an empty right hand side or two… …   Wikipedia

  • Dependency grammar — Hybrid constituency/dependency tree from the Quranic Arabic Corpus Dependency grammar (DG) is a class of syntactic theories developed by Lucien Tesnière. It is distinct from phrase structure grammars, as it lacks phrasal nodes. Structure is… …   Wikipedia

  • Periodic graph (crystallography) — For other uses, see Periodic graph. A (large) unit cell of Diamond crystal net; the balls represent carbon atoms and the sticks represent covalent bonds …   Wikipedia

  • De Bruijn graph — In graph theory, an n dimensional De Bruijn graph of m symbols is a directed graph representing overlaps between sequences of symbols. It has mn vertices, consisting of all possible length n sequences of the given symbols; the same symbol may… …   Wikipedia

  • Tree-adjoining grammar — (TAG) is a grammar formalism defined by Aravind Joshi. Tree adjoining grammars are somewhat similar to context free grammars, but the elementary unit of rewriting is the tree rather than the symbol. Whereas context free grammars have rules for… …   Wikipedia

  • Straight-line grammar — Straight line grammars (SLG) are formal grammars that do not branch (every non terminal has only one associated production rule) nor loop (if non terminal A appears in a derivation of B, B does not appear in a derivation of A). Such grammars… …   Wikipedia

  • Graphersetzungssystem — Beispiel für Graphersetzungsregel (Optimierung aus dem Compilerbau: Multiplikation mit 2 durch Addition ersetzt) Graphersetzungssysteme dienen der formalen Beschreibung der Veränderung von Graphen. Ein Graphersetzungssystem ist eine Menge M von… …   Deutsch Wikipedia

  • Denotational semantics — In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach to formalizing the meanings of programming languages by constructing mathematical objects (called denotations)… …   Wikipedia

  • Christoph Klauck — (* 20. Jahrhundert) ist Professor an der Hochschule für Angewandte Wissenschaften Hamburg (HAW). Er lehrt dort an der Fakultät Technik und Informatik im Studiendepartment Informatik. Seine speziellen Fachgebiete sind die Künstliche Intelligenz… …   Deutsch Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»